Counting generalized Reed-Solomon codes
نویسندگان
چکیده
In this article we count the number of [n, k] generalized Reed– Solomon (GRS) codes, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of [n, 3] MDS codes with n = 6, 7, 8, 9.
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملNew Deep Holes of Generalized Reed-Solomon Codes
Deep holes play an important role in the decoding of generalized Reed-Solomon codes. Recently, Wu and Hong [11] found a new class of deep holes for standard Reed-Solomon codes. In the present paper, we give a concise method to obtain a new class of deep holes for generalized Reed-Solomon codes. In particular, for standard Reed-Solomon codes, we get the new class of deep holes given in [11]. Li ...
متن کاملUnambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance
The Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We adapt this result to the case of Generalized Reed– Solomon codes and calculate the parameters of the corresponding Interleaved Generalized Reed–Solomon code. Fu...
متن کاملOn the third weight of generalized Reed-Muller codes
In this paper, we study the third weight of generalized Reed-Muller codes. Using results from [6], we prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of small order with two variables. In some cases, we are able to determine the third weight and the third weight codewords of generalized Re...
متن کاملGeneralized Reed-Muller codes over Galois rings
Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1611.04341 شماره
صفحات -
تاریخ انتشار 2016